# -*- coding: utf-8 -*-
"""
Created on Sat Sep 19 16:18:43 2020

@author: Administrator
"""

'''
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

You may assume that the intervals were initially sorted according to their start times.

 

Example 1:

Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]
Example 2:

Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
Output: [[1,2],[3,10],[12,16]]
Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].
Example 3:

Input: intervals = [], newInterval = [5,7]
Output: [[5,7]]
Example 4:

Input: intervals = [[1,5]], newInterval = [2,3]
Output: [[1,5]]
Example 5:

Input: intervals = [[1,5]], newInterval = [2,7]
Output: [[1,7]]
'''

class Solution:
    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
        '''
        20200919--李运辰
        
        '''
        
        intervals.append(newInterval)
        
        intervals.sort()
        length = len(intervals)
        if length<=1:
            return intervals
        stack = [intervals[0]]
        
        for i in range(1,length):
            latestart,latesend = stack[-1][0], stack[-1][1]
            curstart,curend = intervals[i][0],intervals[i][1]
            
            if latesend>=curstart:
                stack[-1]=[curstart  if curstart<latestart else latestart,  latesend if latesend>curend else curend]
            else:
                stack.append(intervals[i])
        return stack